Shuffle on array languages generated by array grammars

Shuffle on Array Languages Generated by Array Grammars

Motivated by the studies done by G. Siromoney et al. (1973) and Alexandru Mateescu et al. (1998) we examine the language theoretic results related to shuffle on trajectories by making use of Siromoney array grammars such as (R : R)AG, (R : CF )AG, (CF : R)AG, (CF : CF )AG, (CS : R)AG, (CS : CS)AG and (CF : CS)AG which are more powerful than the Siromoney matrix grammars (1972) and are used to m...

REPRESENTATIONS OF RECURSIVELY ENUMERABLE ARRAY LANGUAGES BY d-DIMENSIONAL CONTEXTUAL ARRAY GRAMMARS

Array P System with Shuffle on Trajectories

In this paper, we introduce a new concept of trajectory array P system which consists of a membrane structure in which the objects are arrays and the evolutionary rules are given in terms of trajectories. We present some properties of trajectory array P system and compare with certain families of picture languages. We consider a variant of trajectory array P system and show that the languages g...

Parallel Parsing of Languages Generated by Ambiguous Bounded Context Grammars

Using the CRCW PRAM model, we describe a language recognition algorithm for an arbitrary grammar in the class of BCPP grammars 9]. (BCPP grammars, which admit ambiguity, are a generalization of both the NTS grammars 14] and Floyd's bounded context (BC) grammars 4].) Using n processors, the algorithm runs in time O(h log n) (O(h) in the case of an unambiguous grammar), where n is the length of t...

A Comparative Study on Adjunct Array Token Petri Nets with Some Classes of Array Grammars

Adjunct Array Token Petri Net Structures (AATPNS) are recently introduced rectangular picture generating devices which extended the Array token Petri net Structures. AATPNS generated context free and context sensitive kolam array languages and tabled 0L/1L languages. In this paper we compare AATPNS with some simple and expressive picture grammar models like extended pure 2D context-free grammar...